A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Strong Converse for Asymmetric Broadcast Channels

We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.

متن کامل

Royen’s proof of the Gaussian correlation inequality

We present in detail Thomas Royen’s proof of the Gaussian correlation inequality which states that μ(K ∩ L) ≥ μ(K)μ(L) for any centered Gaussian measure μ on R and symmetric convex sets K,L in R.

متن کامل

Strong converse for the classical capacity of all phase-insensitive bosonic Gaussian channels

Submitted for the DAMOP14 Meeting of The American Physical Society Strong converse for the classical capacity of all phase-insensitive bosonic Gaussian channels BHASKAR ROY BARDHAN, Department of Physics and Astronmoy, Louisiana State University, USA, RAUL GARCIAPATRON, Ecole Polytechnique de Bruxelles, Universite Libre de Bruxelles, Belgium and Max-Planck Institut fuer Quantenoptik, Germany, M...

متن کامل

Strong converse for identification via quantum channels

In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede’s recently discovered appoach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking val...

متن کامل

Error Exponent Region for Gaussian Broadcast Channels

In this work, we introduce the notion of the error exponent region for a multi-user channel. This region specifies the set of error-exponent vectors that are simultaneously achievable by all users in the multi-user channel. This is done by associating different probabilities of error for different users, contrary to the traditional approach where a single probability of system error is consider...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2017

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2017.2753224